翻訳と辞書 |
Catalan's triangle : ウィキペディア英語版 | Catalan's triangle
In combinatorial mathematics, Catalan's triangle is a number triangle whose entries give the number of strings consisting of ''n'' X's and ''k'' Y's such that no initial segment of the string has more Y's than X's. It is a generalization of the Catalan numbers, and is named after Eugène Charles Catalan. Some values are given by : Each element is the sum of the one above and the one to the left. The diagonal consists of the Catalan numbers. == General formula == The general formula for is given by
where , and n! denotes the factorial.
抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Catalan's triangle」の詳細全文を読む
スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|